منابع مشابه
Orienting Graphs to Optimize Reachability
It is well known that every 2-edge-connected graph can be oriented so that the resulting digraph is strongly connected. Here we study the problem of orienting a connected graph with cut edges in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y. After transforming this problem, we prove a key theorem about the transformed problem that allo...
متن کاملOrienting edges to fight fire in graphs
We investigate a new oriented variant of the Firefighter Problem. In the traditional Firefighter Problem, a fire breaks out at a given vertex of a graph, and at each time interval spreads to neighbouring vertices that have not been protected, while a constant number of vertices are protected at each time interval. In the version of the problem considered here, the firefighters are able to orien...
متن کاملUsing Symbolic Analysis to Optimize Explicit Reachability Analysis
Advanced techniques in formal veriication have allowed us to verify larger systems using less memory, but run-time requirement is becoming another limiting factor. This work proposes the use of symbolic analysis to extract high-level information about a design , and develops optimizations that use such information to reduce the run-time requirement of explicit reachability analysis. This work a...
متن کاملReachability on prefix-recognizable graphs
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability.
متن کاملReachability on suffix tree graphs
We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed in O(n log n) expected time and space to an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1997
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00129-4